Collective Tree Spanners for Unit Disk Graphs with Applications
نویسندگان
چکیده
منابع مشابه
Collective Tree Spanners for Unit Disk Graphs with Applications
In this paper, we establish a novel balanced separator theorem for Unit Disk Graphs (UDGs), which mimics the well-known Lipton and Tarjan’s planar balanced shortest paths separator theorem. We prove that, in any n-vertex UDG G, one can find two hop-shortest paths P (s, x) and P (s, y) such that the removal of the 3-hopneighborhood of these paths (i.e., N G[P (s, x)∪P (s, y)]) from G leaves no c...
متن کاملCollective Tree Spanners of Graphs
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V,E) admits a system of μ collective additive tree r-spanners if there is a system T (G) of at most μ spanning trees of G such that for any two vertices x, y of G a spanning tree T ∈ T (G) exists such that dT (x, y) ≤ dG(x, y) + r. Among other results, we show that any chordal graph, chordal bipartite ...
متن کاملPlanar Hop Spanners for Unit Disk Graphs
The simplest model of a wireless network graph is the Unit Disk Graph (UDG): an edge exists in UDG if the Euclidean distance between its endpoints is ≤ 1. The problem of constructing planar spanners of Unit Disk Graphs with respect to the Euclidean distance has received considerable attention from researchers in computational geometry and ad-hoc wireless networks. In this paper, we present an a...
متن کاملCollective Tree 1-Spanners for Interval Graphs
In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v we require a tree T ∈ T such that the distance between u and v in T is at most one more than their distance in G. We show that: – there is no constant size set of collective tree 1-spanners for interval graphs (even unit interval gr...
متن کاملCollective additive tree spanners for circle graphs and polygonal graphs
A graphG = (V , E) is said to admit a system ofμ collective additive tree r-spanners if there is a system T (G) of at most μ spanning trees of G such that for any two vertices u, v of G a spanning tree T ∈ T (G) exists such that the distance in T between u and v is at most r plus their distance in G. In this paper, we examine the problem of finding ‘‘small’’ systems of collective additive tree ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2009
ISSN: 1571-0653
DOI: 10.1016/j.endm.2009.02.016